Latin American Theoretical Informatics Conference (LATIN)CORREA, José R; KIWI, Marcos.Algorithmica. 2008, Vol 50, Num 4, issn 0178-4617, 182 p.Conference Proceedings

The chilean highway problemKIWI, Marcos; RUSSELL, Alexander.Theoretical computer science. 2004, Vol 326, Num 1-3, pp 329-342, issn 0304-3975, 14 p.Article

LATIN 2006 (theoretical informatics)Correa, José R; Hevia, Alejandro; Kiwi, Marcos et al.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-32755-X, 1Vol, XVI-814 p, isbn 3-540-32755-XConference Proceedings

A 4-approximation algorithm for guarding 1.5-dimensional terrainsKING, James.Lecture notes in computer science. 2006, pp 629-640, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Efficient approximate dictionary look-up for long words over small alphabetsARSLAN, Abdullah N.Lecture notes in computer science. 2006, pp 118-129, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Exponential lower bounds on the space complexity of OBDD-Based graph algorithmsSAWITZKI, Daniel.Lecture notes in computer science. 2006, pp 781-792, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

RNA molecules : Glimpses through an algorithmic lensCONDON, Anne.Lecture notes in computer science. 2006, pp 8-10, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 3 p.Conference Paper

Modelling errors and recovery for communicationSUDAN, Madhu.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-32755-X, 1Vol, p. 25Conference Paper

A faster algorithm for finding maximum independent sets in sparse graphsFURER, Martin.Lecture notes in computer science. 2006, pp 491-501, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 11 p.Conference Paper

Matching based augmentations for approximating connectivity problemsRAVI, R.Lecture notes in computer science. 2006, pp 13-24, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Algorithmic challenges in web search enginesBAEZA-YATES, Ricardo.Lecture notes in computer science. 2006, pp 1-7, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 7 p.Conference Paper

C-varieties, actions and wreath productCHAUBARD, Laura.Lecture notes in computer science. 2006, pp 274-285, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

The branch-width of circular-arc graphsMAZOIT, Frédéric.Lecture notes in computer science. 2006, pp 727-736, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 10 p.Conference Paper

Electronic jury voting protocolsHEVIA, Alejandro; KIWI, Marcos.Lecture notes in computer science. 2002, pp 415-429, issn 0302-9743, isbn 3-540-43400-3Conference Paper

Finding all minimal infrequent multi-dimensional intervalsELBASSIONI, Khaled M.Lecture notes in computer science. 2006, pp 423-434, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

SquaresHURTADO, Ferran.Lecture notes in computer science. 2006, pp 11-12, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 2 p.Conference Paper

On-line approximate string matching with bounded errorsKIWI, Marcos; NAVARRO, Gonzalo; TELHA, Claudio et al.Theoretical computer science. 2011, Vol 412, Num 45, pp 6359-6370, issn 0304-3975, 12 p.Article

Improved exponential-time algorithms for treewidth and minimum fill-inVILLANGER, Yngve.Lecture notes in computer science. 2006, pp 800-811, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Lossless data compression via error correctionVERDU, Sergio.Lecture notes in computer science. 2006, pp 26-27, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 2 p.Conference Paper

The power and weakness of randomness in computationWIGDERSON, Avi.Lecture notes in computer science. 2006, pp 28-29, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 2 p.Conference Paper

Electronic jury voting protocolsHEVIA, Alejandro; KIWI, Marcos.Theoretical computer science. 2004, Vol 321, Num 1, pp 73-94, issn 0304-3975, 22 p.Conference Paper

A concentration bound for the longest increasing subsequence of a randomly chosen involutionKIWI, Marcos.Discrete applied mathematics. 2006, Vol 154, Num 13, pp 1816-1823, issn 0166-218X, 8 p.Conference Paper

Gaussian Laws for the Main Parameters of the Euclid AlgorithmsLHOTE, Loïck; VALLEE, Brigitte.Algorithmica. 2008, Vol 50, Num 4, pp 497-554, issn 0178-4617, 58 p.Conference Paper

Expected length of the longest common subsequence for large alphabetsKIWI, Marcos; LOEBL, Martin; MATOUSEK, Jiri et al.Lecture notes in computer science. 2004, pp 302-311, issn 0302-9743, isbn 3-540-21258-2, 10 p.Conference Paper

Hardness amplification via space-efficient direct productsGURUSWAMI, Venkatesan; KABANETS, Valentine.Lecture notes in computer science. 2006, pp 556-568, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 13 p.Conference Paper